class Node:
    def __init__(self, initdata):
        self.data = initdata
        self.next = None

    def setData(self, newdata):
        self.data = newdata

    def setNext(self, newnext):
        self.next = newnext

    def getData(self):
        return self.data

    def getNext(self):
        return self.next


class UnorderedList:
    def __init__(self):
        self.head = None

    def add(self, item):
        temp = Node(item)
        temp.setNext(self.head)
        self.head = temp

    def isEmpty(self):
        return self.head==None

    def data(self):
        if self.isEmpty():
            return 0
        current = self.head
        lt = []
        while current is not None:
            lt.append(current.getData())
            current = current.getNext()
        return lt


n=int(input())
lt=list(map(int,input().split()))
uList = UnorderedList()
if n==len(lt):
    for i in lt:
        uList.add(i)
res=uList.data()
for i in range(len(res)-1,-1,-1):
    if i==0:
        print(res[i],end='')
    else:
        print(res[i],end=' ')
